// 完全二叉树节点
var countNodes= function (root) {
    if(root == null ) {
        return 0;
    }
     let l = countNodes(root.left);
     console.log(l);
    let r = countNodes(root.right);
    return l+r+1;
}